finite automaton造句
例句與造句
- Finite automata model for one type of dna computing system
計算系統(tǒng)的有限自動機模型 - A feasible method for achieving finite automaton
有限自動機的類類型實現(xiàn)方法 - Minimize connective finite automata and its complexity
連接型自動機的極小化及其復雜性 - A finite automata model for optimistic contract signing protocols
樂觀電子合同簽訂協(xié)議的一種有限狀態(tài)機模型 - Alternating finite automaton
交替式有限狀態(tài)自動機 - It's difficult to find finite automaton in a sentence. 用finite automaton造句挺難的
- Tao rj . invertibility of finite automata . beijing : science press , 1979 ( in chinese )
陶仁驥.有限自動機的可逆性.北京:科學出版社, 1979 - So the storage structure of finite automaton should the choosed adjacency lists
所以，有窮自動機的存儲結(jié)構(gòu)最好采用鄰接鏈表來存儲。 - As discussed last month , i plan to use deterministic finite automaton to compile the proxy
如上個月所討論的，我計劃用確定性有限自動機（ deterministic finite automaton ， dfa ）來編譯該代理。 - This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata
本文研究了模糊有限自動機的分類和模糊有限自動機的狀態(tài)最小化算法。 - Specifical , the main results are as follows : 1 . lattice - valued finite automata . we introduce the conpect of lattice - valued finite automata
本文主要采用了比較和類比、分析與綜合、歸納、反證等研究方法。 - This task can be achieved by a finite automaton with just two states and a “ program ” consisting of four statements called transition rules
有限自動機在執(zhí)行這項工作時，只需要兩個狀態(tài)和一套含四則轉(zhuǎn)換規(guī)則的程序。 - Although the adjacency matrix was a storage structure of finite automaton in common use , it was not proper to store all kinds of finite automata
摘要盡管鄰接矩陣是有窮自動機的一種常用存儲方法，但是，鄰接矩陣并不適合存儲所有類型的有窮自動機。 - Based on this classification , some important types of fuzzy finite automaton are classified . in the meantime , the relations among these fuzzy finite automata in same models are obtained
同時，在新分類中，在同一類型中的各種原模糊有限自動機類型之間的等價或從屬關(guān)系被證明和獲得。 - In chapter 2 , a class of fuzzy finite automata corresponding to the mealy type of ordinary automata is formulated and two types of statewise equivalence relations are introduced
在第二章中，對應于經(jīng)典mealy型有限狀態(tài)自動機的一類模糊有限狀態(tài)自動機-新mealy型模糊有限狀態(tài)自動機被建立。 - Lastly , we obtain a key theorem which charactarize the link between computing with words via lattice - valued finite automata and computing with numbers via lattice - valued finite automata . 2 . lattice - valued regular grammar
最后,嚴格證明了一個刻畫基于格值有限狀態(tài)自動機的數(shù)值計算和基于格值有限狀態(tài)自動機的詞計算之間的聯(lián)系的一個基本定理。
更多例句： 下一頁